Conditional Tabled Eco-grammar Systems versus Et0l Systems
نویسنده
چکیده
We i n vestigate the generative capacity of the so-called conditional tabled eco-grammar systems CTEG. They are a variant of eco-grammar systems, generative mechanisms recently introduced as models of the interplay b e t ween environment and agents in ecosystems. In particular, we compare the power of CTEG systems with that of programmed and of random context T0L systems and with that of ET0L systems. CTEG systems with one agent only and without extended symbols are found to be surprisingly powerful they can generate non-ET0L languages. Representation theorems for ET0L and for recursively enumerable languages in terms of CTEG languages are also presented.
منابع مشابه
Cooperating Distributed Hyperedge Replacement Grammars
The concept of cooperation and distribution as known from the area of grammar systems is introduced to graph grammars; more precisely, to hyperedge replacement (for short, HR) grammars. This can be seen as a modest approach to controlled HR. Two diierent derivation modes are considered, the so called t-mode and the =k-mode. For the t-mode it is shown that the class of hypergraph languages obtai...
متن کاملSequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity
For tabled Lindenmayer systems and their languages, the degree of synchronization and the degree of nondeterminism are well investigated measures of descriptional complexity. In this paper the sequential counterparts of tabled Lindenmayer systems, namely cooperating distributed grammar systems and their pure variant (working in the so called t-mode of derivation) are treated with respect to the...
متن کاملCooperating Distributed Grammar systems: A Comparison of Generavite Power
Cooperating Distributed Grammar systems have been introduced for describing multi-agent systems by means of formal grammars and languages. There are currently a lot of variations that differ by generative power. This article is focused on summarize definitions of selected CD grammar systems (homogenous, hybrid, and teams) and comparison of their generative power among themselves and against to ...
متن کاملIndexed Grammars , ET 0 L Systems and Programming Languages — A Tribute to Alexandru Mateescu — Radu Nicolescu
We revise and extend a couple of earlier incompletely published papers regarding the competence limits of formal systems in modelling the full syntax of programing languages. We show that the full syntax of mainstream programming languages (e.g. similar to Pascal or CAML) and of schema based XML documents cannot be modelled by either ET0L systems or indexed grammars. We raise a few open questio...
متن کاملSimple Eco-Grammar Systems with Prescribed Teams
The notion of teams in grammar systems is applied to a restriction of eco-grammar systems, called simple eco-grammar systems. These systems were introduced by motivations coming from Artiicial Life and (thus) consist of an environment in the form of a Lindenmayer system and agents working on this environment by context-free productions. Several diierent ways of forming teams of agents, with dii...
متن کامل